Relating Sequent Calculi for Bi-intuitionistic Propositional Logic
نویسندگان
چکیده
منابع مشابه
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusio...
متن کاملSequent calculi for bi-intuitionistic propositional logic
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this talk, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusion...
متن کاملOn Sequent Calculi for Intuitionistic Propositional Logic
The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...
متن کاملA Sequent Based Theorem Prover for Propositional Intuitionistic Logic
We describe a theorem prover based on a new sequent calculus for Intuitionistic Propositional Logic. We discuss the effects of various optimisations, and analyse its performance compared to current state of the art theorem provers. We find that the prover produces competitive results on many classes of formulae.
متن کاملAnnotation-Free Sequent Calculi for Full Intuitionistic Linear Logic
Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex annotations to guarantee soundness and cut-elimination. We give a simple and annotation-free display calculus for FILL which satisfies Belnap’s generic cutelimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.47.7